Infinitary Normalization

نویسندگان

  • Jan Willem Klop
  • Roel C. de Vrijer
چکیده

In infinitary orthogonal first-order term rewriting the properties confluence (CR), Uniqueness of Normal forms (UN), Parallel Moves Lemma (PML) have been generalized to their infinitary versions CR∞, UN∞, PML∞, and so on. Several relations between these properties have been established in the literature. Generalization of the termination properties, Strong Normalization (SN) and Weak Normalization (WN) to SN∞ and WN∞ is less straightforward. We present and explain the definitions of these infinitary normalization notions, and establish that as a global property of orthogonal TRSs they coincide, so at that level there is just one notion of infinitary normalization. Locally, at the level of individual terms, the notions are still different. In the setting of orthogonal term rewriting we also provide an elementary proof of UN∞, the infinitary Unique Normal form property.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Normalisation of Infinitary Combinatory Reduction Systems

For fully-extended, orthogonal infinitary Combinatory Reduction Systems, we prove that terms with perpetual reductions starting from them do not have (head) normal forms. Using this, we show that 1. needed reduction strategies are normalising for fully-extended, orthogonal infinitary Combinatory Reduction Systems, and that 2. weak and strong normalisation coincide for such systems as a whole an...

متن کامل

On modularity in infinitary term rewriting

We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are non-collapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved across direct sum of a finite number of systems. • Normalization is not preserved across direct sum o...

متن کامل

Termination of Threads with Shared Memory via Infinitary Choice

We present a static type discipline on an extension of λcalculus with threads and shared memory ensuring termination. This discipline is based on a type and effects system, and is a condition forced on regions. It generalizes and clarifies the stratification discipline previously proposed in the literature with the same objective, and is directly inspired by positive recursive types. The proof ...

متن کامل

An Introduction to the Clocked Lambda Calculus

We give a brief introduction to the clocked λ-calculus, an extension of the classical λ-calculus with a unary symbol τ used to witness the β-steps. In contrast to the classical λ-calculus, this extension is infinitary strongly normalising and infinitary confluent. The infinitary normal forms are enriched Lévy–Longo Trees, which we call clocked Lévy–Longo Trees. 1998 ACM Subject Classification D...

متن کامل

Levels of Undecidability in Infinitary Rewriting: Normalization and Reachability

In [2] it has been shown that infinitary strong normalization (SN∞) is Π11-complete. Suprisingly, it turns out that infinitary weak normalization (WN∞) is a harder problem, being Π12-complete, and thereby strictly higher in the analytical hierarchy. We assume familiarity with infinitary term rewriting; we further reading we refer to [5,4]. 1 Infinitary Strong Normalization and Reachability Defi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005